On optimal polling policies
نویسندگان
چکیده
منابع مشابه
On optimal polling policies
In a single server polling system, the server visits the queues according to a routing policy and while at a queue serves some or all of the customers there according to a service policy. A polling (or scheduling) policy is a sequence of decisions on whether to serve a customer, idle the server, or switch the server to another queue. The goal of this paper is to nd polling policies that stochas...
متن کاملOn Optimal Cancellation of Policies
One of the basic problems in life is: Given information (from the past), make decisions (that will affect the future). One of the classical actuarial examples is the adaptive ratemaking (or credibility) procedures ; here the premium of a given risk is sequentially adjusted, taking into account the claims experience available when the decisions are made. In some cases, the rates are fixed and th...
متن کاملOn the Optimal Policy for Deterministic and Exponential Polling Systems
In this paper, we consider deterministic (both fluid and discrete) polling systems with N queues with infinite buffers and we show how to compute the best polling sequence (minimizing the average total workload). With two queues, the best polling sequence is always periodic when the system is stable and forms a regular sequence. The fraction of time spent by the server in the first queue is hig...
متن کاملOn the optimal control of a two-queue polling model
This paper deals with two M/M/1 queues served by a single server with threshold switching. Our main goal is to solve the Poisson equation and, as a result, give expressions for the long-run expected average cost of holding units and switching actions of the server, and the bias vector.
متن کاملOptimal routing in two-queue polling systems
We consider a polling system with two queues, exhaustive service, no switch-over times and exponential service times with rate μ in each queue. The waiting cost depends on the position of the queue relative to the server: It costs a customer c per time unit to wait in the busy queue (where the server is) and d per time unit in the idle queue (where no server is). Customers arrive according to a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 1992
ISSN: 0257-0130,1572-9443
DOI: 10.1007/bf01159287